Combining Approximation Algorithms for the Prize-Collecting TSP
نویسنده
چکیده
We present a 1.91457-approximation algorithm for the prize-collecting travelling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of Bienstock et al. [2] and a primal-dual algorithm of Goemans and Williamson [5].
منابع مشابه
Prize-Collecting Traveling Salesman and Related Problems
The most general version of the Prize Collecting Traveling Salesman Problem (PCTSP) was first introduced by Balas [8]. In this problem, a salesman has to collect a certain amount of prizes (the quota) by visiting cities. A known prize can be collected in every city. Furthermore, by not visiting a city, the salesman incurs a pecuniary penalty. The goal is to minimize the total travel distance pl...
متن کاملApproximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems
We give new approximation algorithms for robot routing problems that are variants of the classical traveling salesperson problem (TSP). We are to find a path for a robot, moving at speed at most s, to visit a set V = {v1, . . . , vn} of sites, each having an associated time window of availability, [ri, di], between a release time ri and a deadline di. In the time-window prize collecting problem...
متن کاملApproximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
Abstract. We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a (2.88+ǫ)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with ...
متن کاملA 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a speci...
متن کاملA Primal-Dual Clustering Technique with Applications in Network Design
Network design problems deal with settings where the goal is to design a network (i.e., find a subgraph of a given graph) that satisfies certain connectivity requirements. Each requirement is in the form of connecting (or, more generally, providing large connectivity between) a pair of vertices of the graph. The goal is to find a network of minimum length, and in some cases requirements can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0910.0553 شماره
صفحات -
تاریخ انتشار 2009